Treewidth of Circle Graphs
نویسنده
چکیده
In this paper we show that the treewidth of a circle graph can be computed in polynomial time. A circle graph is a graph that is isomorphic to the intersection graph of a finite collection of chords of a circle. The TREEWIDTH problem can be viewed upon as the problem of finding a chordal embedding of the graph that minimizes the maximum clique size. Our algorithm to determine the treewidth of a circle graph can be implemented to run in O(n3 ) time, where n is the number of vertices of the graph.
منابع مشابه
Minimal Separators in Intersection Graphs
In this report, we present the intersection graphs and describe the role they play in computations of treewidth. We introduce minimal triangulations, minimal separators, potential maximal cliques and blocks as the main tools for exact computation and approximation of that important graph parameter. The first chapter is an introduction to the intersection graph theory. We give all the necessary ...
متن کاملGraph Isomorphism Restricted by Lists
The complexity of graph isomorphism (GraphIso) is a famous unresolved problem in theoretical computer science. For graphs G and H, it asks whether they are the same up to a relabeling. In 1981, Lubiw proved that list restricted graph isomorphism (ListIso) is NP-complete: for each u ∈ V (G), we are given a list L(u) ⊆ V (H) of possible images of u. After 35 years, we revive the study of this pro...
متن کاملCircle graphs and monadic second-order logic
A circle graph is the intersection graph of a set of chords of a circle. If a circle graph is prime for the split (or join) decomposition defined by Cunnigham, it has a unique representation as a set of intersecting chords, and we prove that this representation can be defined by monadic second-order formulas. By using the (canonical) split decomposition of a circle graph, one can define in mona...
متن کاملPlanar Graphs and Partial k-Trees
It is well-known that many NP-hard problems can be solved efficiently on graphs of bounded treewidth. We begin by showing that Knuth’s results on nested satisfiability are easily derived from this fact since nested satisfiability graphs have treewidth at most three. Noting that nested satisfiability graphs have a particular form of planar drawing, we define a more general form of graph drawing ...
متن کاملBounded Treewidth Graphs – A Survey German Russian Winter School St. Petersburg, Russia
This survey gives an introduction to the class of bounded treewidth graphs, for which many NP-complete problems can be solved efficiently. The concept of a tree decomposition is explained. Subclasses of the bounded treewidth graphs are identified. Results about finding tree decompositions are summarized. Some problems which are efficiently solvable on bounded treewidth graphs are listed and alg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1993